منابع مشابه
Qubit Semantics and Quantum Trees
In the qubit semantics the meaning of any sentence α is represented by a quregister : a unit vector of the n–fold tensor product ⊗C, where n depends on the number of occurrences of atomic sentences in α (see [CDCGL01]). The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the non-contradiction principle is violated. We show that QCL does not a...
متن کاملSmart Semantics for Fault Trees
Systems used e.g. in nuclear power plants and railroad infrastructures require analysis to know about the risk of failures and the effect of different maintenance strategies on this risk. One way to analyse these systems is by building Dynamic Fault Trees (DFTs) and analysing the corresponding Input/Output Interactive Markov Chains (I/OIMCs). Although the I/O IMCs are used for analysis, there i...
متن کاملA Semantics for Behavior Trees
The Behavior Tree notation is used as part of a framework for developing complex computer systems. The framework is designed to simplify the process of constructing a formal specification of a system from its informal functional requirements. To give a meaning to Behavior Trees, this paper describes a lower-level language called Behavior Tree Process Algebra (BTPA) and its operational semantics...
متن کاملSyntax and Semantics of Abstract Binding Trees
binding trees (abts) are a generalization of abstract syntax trees where operators may express variable binding structure as part of their arities. Originally formulated by Peter Aczel [1], unisorted abts have been deployed successfully as the uniform syntactic framework for several implementations of Constructive Type Theory, including Nuprl [3], MetaPRL [13] and JonPRL [21]. In Practical Foun...
متن کاملTransitions and Trees - An Introduction to Structural Operational Semantics
ion, concurrency, non-determinism and the features of functional programming languages. Along the way, the text introduces and applies the relevant proof techniques, including forms of induction and notions of semantic equivalence (including bisimilarity). Thoroughly class-tested, this book has evolved from lecture notes used by the author over a 10-year period at Aalborg University to teach un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00107-7